scheduling constraint

См. также в других словарях:

• Constraint satisfaction problem — Constraint satisfaction problems (CSP)s are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations. CSPs represent the entities in a problem as a homogeneous collection of finite… …   Wikipedia

• Constraint Handling Rules — (CHR) is a declarative programming language extension introduced in 1991[1][2] by Thom Frühwirth. Originally designed for developing (prototypes of) constraint programming systems, CHR is increasingly used as a high level general purpose… …   Wikipedia

• Constraint satisfaction — In artificial intelligence and operations research, constraint satisfaction is the process of finding a solution to a set of constraints that impose conditions that the variables must satisfy. A solution is therefore a vector of variables that… …   Wikipedia

• Constraint programming — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computin …   Wikipedia

• Nurse scheduling problem — The Nurse scheduling problem (NSP) is the problem of determining a work schedule for nurses that is both reasonable (or fair) and efficient. Despite seeming trivial, this is a complex problem due to its many constraints and many possible… …   Wikipedia

• Genetic algorithm scheduling — To be competitive, corporations must minimize inefficiencies and maximize productivity. In manufacturing, productivity is inherently linked to how well you can optimize the resources you have, reduce waste and increase efficiency. Finding the… …   Wikipedia

• Advanced planning and scheduling — Advanced Planning Scheduling (also referred to as APS and Advanced Manufacturing) refers to a manufacturing management process by which raw materials and production capacity are optimally allocated to meet demand. APS is especially well suited to …   Wikipedia

• Automated planning and scheduling — is a branch of artificial intelligence that concerns the realization of strategies or action sequences, typically for execution by intelligent agents, autonomous robots and unmanned vehicles. Unlike classical control and classification problems,… …   Wikipedia

• Least slack time scheduling — Least Slack Time (LST) scheduling is a scheduling algorithm. It assigns priority based on the slack time of a process. Slack time is the amount of time left after a job if the job was started now. This algorithm is also known as Least Laxity… …   Wikipedia

• Advanced Planning and Scheduling — Systeme (APS Systeme) werden in der Produktionswirtschaft zur Unterstützung der Planungsfunktionen nach MRP II Methode, also beispielsweise die zurzeit üblichen ERP Systeme und viele PPS Systeme, eingesetzt. Eine allgemein anerkannte und exakte… …   Deutsch Wikipedia

• Project management — is the discipline of planning, organizing, securing, and managing resources to achieve specific goals. A project is a temporary endeavor with a defined beginning and end (usually time constrained, and often constrained by funding or deliverables) …   Wikipedia